On distance-regular graphs with smallest eigenvalue at least -m
نویسندگان
چکیده
A non-complete geometric distance-regular graph is the point graph of a partial geometry in which the set of lines is a set of Delsarte cliques. In this paper, we prove that for fixed integer m ≥ 2, there are only finitely many non-geometric distance-regular graphs with smallest eigenvalue at least −m, diameter at least three and intersection number c2 ≥ 2.
منابع مشابه
The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
We prove a conjecture by Van Dam & Sotirov on the smallest eigenvalue of (distance-j) Hamming graphs and a conjecture by Karloff on the smallest eigenvalue of (distance-j) Johnson graphs. More generally, we study the smallest eigenvalue and the second largest eigenvalue in absolute value of the graphs of the relations of classical P and Q-polynomial association schemes.
متن کاملExceptional Graphs with Smallest Eigenvalue -2 and Related Problems
This paper summarizes the known results on graphs with smallest eigenvalue around -2 , and completes the theory by proving a number of new results, giving comprehensive tables of the finitely many exceptions, and posing some new problems. Then the theory is applied to characterize a class of distance-regular graphs of large diameter by their intersection array.
متن کاملDistance-regular Cayley graphs with least eigenvalue -2
We classify the distance-regular Cayley graphs with least eigenvalue −2 and diameter at most three. Besides sporadic examples, these comprise of the lattice graphs, certain triangular graphs, and line graphs of incidence graphs of certain projective planes. In addition, we classify the possible connection sets for the lattice graphs and obtain some results on the structure of distance-regular C...
متن کاملOn the limit points of the smallest eigenvalues of regular graphs
In this paper, we give infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [−1− √ 2,−2) and also infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [α1,−1− √ 2) where α1 is the smallest root(≈ −2.4812) of the polynomial x3 + 2x2 − 2x − 2. From these results, we ...
متن کاملOn the Diameter and Some Related Invariants of Fullerene Graphs∗
Fullerene graphs are 3-connected 3-regular planar graphs with only pentagonal and hexagonal faces. We show that the diameter of a fullerene graph G of order n is at least √ 24n−15−3 6 and at most n/5 + 1. Moreover, if G is not a (5, 0)-nanotube its diameter is at most n/6+5/2. As a consequence, we improve the upper bound on the saturation number of fullerene graphs. We also report an improved l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 100 شماره
صفحات -
تاریخ انتشار 2010